Frame Logic under Answer Set Semantics
نویسندگان
چکیده
Frame logic is well known as a useful ontology modeling formalism, mainly appreciated for its object-oriented features and its nonmonotonic variant, capable to deal with typical nonmonotonic features such as object oriented inheritance. This paper presents a preliminary work defining a framework for coping with frame-like syntax and higher order reasoning within an answer set programming environment. Semantics is defined by means of a translation to an ordinary answer set program. A working prototype, together with usage examples, is presented. The works paves the way to further deeper studies about the usage of frame logic-like constructs under Answer Set Semantics.
منابع مشابه
Query Answering in Resource-Based Answer Set Semantics
In recent work we defined resource-based answer set semantics, which is an extension to answer set semantics stemming from the study of its relationship with linear logic. In fact, the name of the new semantics comes from the fact that in the linear-logic formulation every literal (including negative ones) were considered as a resource. In this paper, we propose a query-answering procedure remi...
متن کاملMarkov Logic Style Weighted Rules under the Stable Model Semantics
We introduce the language LP that extends logic programs under the stable model semantics to allow weighted rules similar to the way Markov Logic considers weighted formulas. LP is a proper extension of the stable model semantics to enable probabilistic reasoning, providing a way to handle inconsistency in answer set programming. We also show that the recently established logical relationship b...
متن کاملAnswer set programming and plan generation
The idea of answer set programming is to represent a given computational problem by a logic program whose answer sets correspond to solutions, and then use an answer set solver, such as smodels or dlv, to nd an answer set for this program. Applications of this method to planning are related to the line of research on the frame problem that started with the invention of formal nonmonotonic reaso...
متن کاملTransitive Closure, Answer Sets and Predicate Completion
We prove that the usual logic programming definition of transitive closure is correct under the answer set semantics, and investigate under what conditions it is correct under the completion semantics. That definition is allowed here to be combined with an arbitrary set of rules that may contain negation as failure, not merely with a set of facts. This work is motivated by applications to answe...
متن کاملRough Description Logic Programs
The Semantic Web is an extension of the current World Wide Web, and aims to help computers to understand and process web information automatically. In recent years, the integration ontologies and rules has become a central topic in the Semantic Web. Therefore, many researchers have focused their study on investigating the combination of answer set programming with description logics for the sem...
متن کامل